def find_max_crossing_subarray(total_array, low, mid, high):
    left_sum = -100000
    temp_sum = 0
    for i in range(mid,low,-1):
        temp_sum= temp_sum + total_array[i]
        if temp_sum > left_sum:
            left_sum = temp_sum
            max_left = i
    
    right_sum = -10000
    temp_sum = 0
    for j in range(mid+1,high):
        temp_sum = temp_sum + total_array[j]
        if temp_sum > right_sum:
            right_sum = temp_sum
            max_right = j
            
    return max_left,max_right,left_sum + right_sum
    